TSTP Solution File: SET635^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET635^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:12:35 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 15
% Syntax : Number of formulae : 70 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 393 ( 98 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 461 ( 77 ~; 69 |; 100 &; 208 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 20 ^ 12 !; 6 ?; 39 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_10,type,
sK2: a > $o ).
thf(func_def_12,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK5: a ).
thf(f100,plain,
$false,
inference(avatar_sat_refutation,[],[f74,f75,f79,f90,f93,f96,f99]) ).
thf(f99,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f98,plain,
( $false
| ~ spl3_2
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f97,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_5 ),
inference(forward_demodulation,[],[f84,f63]) ).
thf(f63,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f61]) ).
thf(f61,plain,
( spl3_2
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f84,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f82]) ).
thf(f82,plain,
( spl3_5
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f96,plain,
( ~ spl3_4
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f95]) ).
thf(f95,plain,
( $false
| ~ spl3_4
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f94]) ).
thf(f94,plain,
( ( $false = $true )
| ~ spl3_4
| ~ spl3_6 ),
inference(backward_demodulation,[],[f72,f88]) ).
thf(f88,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f86]) ).
thf(f86,plain,
( spl3_6
<=> ( $false
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f72,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f70,plain,
( spl3_4
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f93,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f92]) ).
thf(f92,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f91,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f59,f67]) ).
thf(f67,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f65,plain,
( spl3_3
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f59,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f57]) ).
thf(f57,plain,
( spl3_1
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f90,plain,
( spl3_3
| spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f24,f86,f82,f65]) ).
thf(f24,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f23]) ).
thf(f23,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f22]) ).
thf(f22,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( ~ ( sK2 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f21]) ).
thf(f21,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( ~ ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 ) )
= $false )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f19]) ).
thf(f19,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( $false
= ( ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
!= ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) )
@ sK5 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ~ ( X2 @ Y0 )
& ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X0 @ Y0 ) ) ) ) )
=> ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ~ ( X2 @ Y0 )
& ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ~ ( X2 @ Y0 )
& ( X0 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ( X0 @ X3 )
& ( X2 @ X3 ) )
& ( X1 @ X3 )
& ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( X0 @ X4 )
& ~ ( X2 @ X4 )
& ( X1 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ( X0 @ X3 )
& ( X2 @ X3 ) )
& ( X1 @ X3 )
& ( X0 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
& ~ ( X2 @ X3 )
& ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ( X0 @ X3 )
& ( X2 @ X3 ) )
& ( X1 @ X3 )
& ( X0 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
& ~ ( X2 @ X3 )
& ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_117_pme) ).
thf(f79,plain,
spl3_4,
inference(avatar_split_clause,[],[f38,f70]) ).
thf(f38,plain,
( $true
= ( sK1 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f36]) ).
thf(f36,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f35]) ).
thf(f35,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f31]) ).
thf(f31,plain,
( ( ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f75,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f48,f61,f65]) ).
thf(f48,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f47]) ).
thf(f47,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f46]) ).
thf(f46,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f42]) ).
thf(f42,plain,
( ( $true
= ( ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f41,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ( $true
= ( ~ ( sK2 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f31]) ).
thf(f74,plain,
spl3_1,
inference(avatar_split_clause,[],[f53,f57]) ).
thf(f53,plain,
( ( sK0 @ sK5 )
= $true ),
inference(duplicate_literal_removal,[],[f52]) ).
thf(f52,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET635^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 11:51:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 % (13521)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (13522)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.38 % (13518)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (13515)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.14/0.38 % (13518)Instruction limit reached!
% 0.14/0.38 % (13518)------------------------------
% 0.14/0.38 % (13518)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (13518)Termination reason: Unknown
% 0.14/0.38 % (13518)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (13518)Memory used [KB]: 5500
% 0.14/0.38 % (13518)Time elapsed: 0.003 s
% 0.14/0.38 % (13518)Instructions burned: 2 (million)
% 0.14/0.38 % (13518)------------------------------
% 0.14/0.38 % (13518)------------------------------
% 0.14/0.38 % (13522)Refutation not found, incomplete strategy
% 0.14/0.38 % (13522)------------------------------
% 0.14/0.38 % (13522)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (13522)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (13522)Memory used [KB]: 5500
% 0.14/0.38 % (13522)Time elapsed: 0.003 s
% 0.14/0.38 % (13522)Instructions burned: 2 (million)
% 0.14/0.38 % (13522)------------------------------
% 0.14/0.38 % (13522)------------------------------
% 0.14/0.38 % (13521)First to succeed.
% 0.14/0.38 % (13520)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.14/0.38 % (13516)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.14/0.38 % (13515)Also succeeded, but the first one will report.
% 0.14/0.38 % (13521)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (13521)------------------------------
% 0.14/0.39 % (13521)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (13521)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (13521)Memory used [KB]: 5500
% 0.14/0.39 % (13521)Time elapsed: 0.005 s
% 0.14/0.39 % (13521)Instructions burned: 4 (million)
% 0.14/0.39 % (13521)------------------------------
% 0.14/0.39 % (13521)------------------------------
% 0.14/0.39 % (13514)Success in time 0.016 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------